package leetcode.weekly.week311;

//Solution1Test
public class Solution1 {

	public int smallestEvenMultiple(int n) {
		return lcm(2, n);
	}

	public int gcd(int a, int b) {
		return b == 0 ? a : gcd(b, a % b);
	}

	public int lcm(int a, int b) {
		return a * b / gcd(a, b);
	}

}
